A program transformation from equational programs into logic programs

A Program Transformation for Backwards Analysis of Logic Programs

The input to backwards analysis is a program together with properties that are required to hold at given program points. The purpose of the analysis is to derive initial goals or pre-conditions that guarantee that, when the program is executed, the given properties hold. The solution for logic programs presented here is based on a transformation of the input program, which makes explicit the de...

Transformation of Logic Programs

Call Unfolding Strategies for Equational Logic Programs

For a programming system based on term rewrite rules such as equational logic programming, a serious eeciency problem of the generated code is the creation of terms that only serve to drive further pattern matching. In this paper, we deene a terminating call unfolding strategy based on ne-grain partial evaluation that removes much of this unnecessary term allocation for programs in intermediate...

A Transformation of Propositional Prolog Programs into Classical Logic

We transform a propositional Prolog program P into a set of propositional formulas prl(P ) and show that Prolog, using its depth-first left-to-right search, is sound and complete with respect to prl(P ). This means that a goal succeeds in Prolog if and only if it follows from prl(P ) in classical propositional logic. The generalization of prl(P ) to predicate logic leads to a system for which P...

Verification of Imperative Programs by Constraint Logic Program Transformation

We present a method for verifying partial correctness properties of imperative programs that manipulate integers and arrays by using techniques based on the transformation of constraint logic programs (CLP). We use CLP as a metalanguage for representing imperative programs, their executions, and their properties. First, we encode the correctness of an imperative program, say prog, as the negati...